Upper bounds for singular values

Upper Bounds and Values For

Let r(G,H) be the smallest integer N such that for any 2-coloring (say, red and blue) of the edges of Kn, n > N there is either a red copy of G or a blue copy of H . Let Kn − K1,s be the complete graph on n vertices from which the edges of K1,s are dropped. In this note we present exact values for r(Km −K1,1,Kn −K1,s) and new upper bounds for r(Km,Kn−K1,s) in numerous cases. We also present som...

RELIABLE STATE-SPACE UPPER BOUNDS FOR THE PEAK STRUCTURED SINGULAR VALUEs

A state-space method for computing upper bounds for the peak of the structured singular value over frequency for both real and complex uncertainties is presented. These bounds are based on the positivity and Popov criteria for one-sided, sector-bounded and for norm-bounded, block-structured linear uncertainty. These criteria are restated and used to derive upper bounds for the peak structured s...

Some Bounds for the Singular Values of Matrices

Abstract We know that to estimate matrix singular values ( especially the largest and the smallest ones ) is an attractive topic in matrix theory and numerical analysis. In this note, we first provide a simple estimate for the smallest singular value σn(A) of n × n positive definite matrix A. Secondly, we obtain some simple estimates for the smallest singular value σn(A) and the largest singula...

Some bounds for extreme singular values of a complex matrix

Dedicated to Professor H. M. Srivastava on the Occasion of his Seventieth Birth Anniversary

Perturbation bounds for eigenvalues of diagonalizable matrices and singular values